Neil Robertson (mathematician) Totally Explained

Everything about Neil Robertson Mathematician totally explained

G. Neil Robertson is a mathematician working mainly in topological graph theory, currently a distinguished professor at The Ohio State University. He earned his Ph.D. in 1969 at the University of Waterloo under his doctoral advisor William Tutte. According to the criteria of the Erdős Number Project, Dr. Robertson has an Erdős number of 3, but it can be lowered to 2 if an obituary he coauthored with Arthur M. Hobbs is counted.

Biography

In 1969, Robertson joined the faculty of The Ohio State University, where he was promoted to Associate Professor in 1972 and Professor in 1984. He was a consultant with Bell Communications Research from 1984 to 1996. He has held visiting faculty positions in many institutions, most extensively at Princeton University from 1996 to 2001, and most recently at Victoria University of Wellington, New Zealand, in 2002.

Conferences

Invited or contributed presentations

One week lecture series at the University of New Hampshire, Durham, New Hampshire: On the proof of the 4-color theorem, 2 hour lectures, and On the proof of the graph minor theorem, 2 hour lectures, November, 1994.
AMS meeting at the University of Central Florida, Orlando, Florida: Binary matroids of branch-width three, 20 minutes, March 1995.
The R. C. Bose Memorial conference, Fort Collins, Colorado: The four-color theorem, 36 minutes, June 1995.
The third Slovene international conference in graph theory, Bled, Slovenia: Results and problems about representativity of graph embeddings, 50 minutes, June 1995.
The AMS, IMS, Siam Joint Summer Research Conference, University of Washington, Seattle, Washington: Binary matroids of branch-width three, 45 minutes, July 1995.
AMS meeting in Guanajuato, Mexico: Planar graphs on nonplanar surfaces", 20 minutes, November 1995.
Some thoughts on Hadwiger's Conjecture. June 28, 1999.

Video

Short conference video

. Neil Robertson - Some thoughts on Hadwiger's Conjecture. June 28, 1999. Video produced by Bojan Mohar.

Theorem proofs

Four color theorem

Robertson-Seymour theorem (Wagner's Conjecture)

Hadwiger conjecture (graph theory)

Strong Perfect Graph Theorem

Prizes

Fulkerson Prize (1994, 2006)

Pólya Prize (SIAM) (2004)

Distinguished Scholar Award (OSU) (1997)

Alumni Achievement Medal (Waterloo) (2002)Further Information

Get more info on 'Neil Robertson Mathematician'.

External Link Exchanges

Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:

<a href="http://neil_robertson__mathematician.totallyexplained.com">Neil Robertson (mathematician) Totally Explained</a>

Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned.